Pareto Bayesian Optimization Algorithm for the Multiobjective 0/1 Knapsack Problem
نویسندگان
چکیده
This paper deals with the utilizing of the Bayesian optimization algorithm (BOA) for the Pareto bi-criteria optimization of the 0/1 knapsack problem. The main attention is focused on the incorporation of the Pareto optimality concept into classical structure of the BOA algorithm. We have modified the standard algorithm BOA for one criterion optimization utilizing the known niching techniques to find the Pareto optimal set. The experiments are focused mainly on the bi-criteria optimization because of the visualization simplicity but it can be extended to multiobjective optimization, too.
منابع مشابه
Multiobjective Bayesian Optimization Algorithm for Combinatorial Problems: Theory and practice
This paper deals with the utilizing of the Bayesian optimization algorithm (BOA) for the multiobjective optimization of combinatorial problems. Three probabilistic models used in the Estimation Distribution Algorithms (EDA), such as UMDA, BMDA and BOA which allow to search effectively on the promising areas of the combinatorial search space are discussed. The main attention is focused on the in...
متن کاملM-PAES: A Memetic Algorithm for Multiobjective Optimization
A memetic algorithm for tackling multiobjective optimization problems is presented. The algorithm employs the proven local search strategy used in the Pareto archived evolution strategy (PAES) and combines it with the use of a population and recombination. Verification of the new algorithm is carried out by testing it on a set of multiobjective 0/1 knapsack problems. On each problem instance, c...
متن کاملMultiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Evolutionary algorithms (EA’s) are often well-suited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to multiobjective optimization have been developed that are capable of searching for multiple solutions concurrently in a single run. However, the few comparative studies of different methods presented up to now remain mostly...
متن کاملGuided Pareto Local Search and its Application to the 0/1 Multi-objective Knapsack Problems
Pareto Local Search (PLS) is a generalization of the local search algorithms to handle more than one objective. In this paper, two variants of PLS are examined on the multiobjective 0/1 knapsack problems, compared with three well-known multiobjective EA algorithms, namely SPEA, SPEA2 and NSGA2. Furthermore, A Guided Local Search (GLS) based multiobjective optimization algorithm is proposed, the...
متن کاملZitzler and Thiele : Multiobjective Evolutionary Algorithms | Comparison and Strength Pareto Approach
| Evolutionary algorithms (EAs) are often well-suited for optimization problems involving several, often connicting objectives. Since 1985, various evolutionary approaches to multiobjective optimization have been developed that are capable of searching for multiple solutions concurrently in a single run. However, the few comparative studies of diierent methods presented up to now remain mostly ...
متن کامل